Evacuation route planning for alternative fuel vehicles

As the number of adopted alternative fuel vehicles increases, it is crucial for communities (especially those that are susceptible to hazards) make evacuation plans account such refueling needs. During emergencies require preemptive planning, travelers using vulnerable when routes do not provide access stations on their way shelters. In this paper, we formulate and solve a novel seamless route plan problem, by designing $k$-minimum spanning trees with hop constraints capture needs each $k \in K$ vehicle type reach shelter. We develop branch-and-price algorithm based matheuristic column generation approach problem. apply proposed framework Sioux Falls transportation network existing infrastructure deployment present numerical experiments. Specifically, discuss travel times under scenarios various driving ranges. Our findings show characteristics type, like range topology, play pivotal role in determining plans. This means an could prove unique single while being infeasible others. Finally, observe force evacuee detour meet before reaching safety increase total time 7.32 % one evaluated scenarios.